Multi-agent Based Solution for Free Flight Conflict Detection and Resolution Using Particle Swarm Optimization Algorithm

نویسندگان

  • Hojjat Emami
  • Farnaz Derakhshan
چکیده

The future management of air traffic allows aircraft choosing their own velocities, altitudes and directions in real time. In aviation industry, this possibility is known as “free flight”. One of the most important issues in the free flight method is conflict detection and resolution problem. In successful free flight, conflicts while maintaining satisfactory performance must be avoided. This paper, presents a multiagent based conflict detection and resolution approach for free flight. In this paper, aircraft and ground flight path controllers are selected as agents, respectively called Aircraft Agent or “AA” and Flight Path Controller Agent or “FPCA”. This type of agent selection provides a proper balance between distributed and centralized authority in order to solve air traffic conflicts and this is one of the advantages of our proposed system. FPCA agents map the situation of traffic in their vision domain to a flow graph using negotiation with aircraft agents. After some conversion on mapped graph, agents color the corresponding graph using Particle Swarm Optimization (PSO) algorithm. The proposed method is implemented and tested by using five well-known test cases. The experimental results show the high capability and efficiency of our approach for conflict problem. The advantages of using our proposed system includes delay reduction, passenger comfort, safety and speed increase, travel time reduction and less fuel consumption. This system not only proposed for free flight but also can use along with the current air traffic management systems without completely replaces them.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

International Conference on Application and Theory of Automation in Command and Control Systems, ATACCS '13, Naples, Italy, May 28-30, 2013

This paper presents the Anytime Stochastic Conflict Detection and Resolution system (ASCDR), which automatically identifies conflicts between multiple aircraft and proposes the most effective solution 4D trajectory considering the available computation time. The system detects conflicts using an algorithm based on axis-aligned minimum bounding box and resolves them cooperatively using a collisi...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

Identifying overlapping communities using multi-agent collective intelligence

The proposed algorithm in this research is based on the multi-agent particle swarm optimization as a collective intelligence due to the connection between several simple components which enables them to regulate their behavior and relationships with the rest of the group according to certain rules. As a result, self-organizing in collective activities can be seen. Community structure is crucial...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

A Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times

We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014